Deadlock detection without wait-for graphs
نویسنده
چکیده
منابع مشابه
Asynchronous Operations in Distributed Concurrency Control
Distributed locking is commonly adopted for performing concurrency control in distributed systems. It incorporates additional steps for handling deadlocks. This activity is carried out by methods based on wait-for-graphs or probes. The present study examines detection of conflicts based on enhanced local processing for distributed concurrency control. In the proposed “edge detection” approach, ...
متن کاملA Revised Algorithms for Deadlock Detection and Resolution in Mobile Agent Systems
A study on Deadlock detection is being done for many years. Not much work has been done on Deadlock resolution. Wait –for model approach followed to avoid deadlocks offers incorrectness to many algorithms after deadlocks have been resolved. In this paper, a theoretical framework for wait-for systems is provided, and general characteristics of a correct algorithm for deadlock detection and resol...
متن کاملOptimal Deadlock Detection in Distributed Systems Based on Locally Constructed Wait-for Graphs
We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case mes...
متن کاملOptimal Deadlock Detection in Distributed Systems Based on Locally Constructed Wait-for Graphs - Distributed Computing Systems, 1996., Proceedings of the 16th International Conference on
We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case mes...
متن کاملImplementation of Deadlock Detection in a Simulated Network Environment
We develop and present an approach to modeling resource allocations and dependencies within cut-through and wormhole interconnection networks. We also present a theoretical framework which allows the precise description of various types of message blocking behavior including deadlock. We show that a knot within a channel wait-for graph is a necessary and sufficient condition for deadlock. Our f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 1991